The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
نویسندگان
چکیده
منابع مشابه
The minimal polynomial of sequence obtained from componentwise linear transformation of linear recurring sequence
Let S = (s1, s2, . . . , sm, . . .) be a linear recurring sequence with terms in GF (q) and T be a linear transformation of GF (q) over GF (q). Denote T (S) = (T (s1), T (s2), . . . , T (sm), . . .). In this paper, we first present counter examples to show the main result in [A.M. Youssef and G. Gong, On linear complexity of sequences over GF (2), Theoretical Computer Science, 352(2006), 288-29...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولThe minimal polynomial over Fq of linear recurring sequence over Fqm
Recently, motivated by the study of vectorized stream cipher systems, the joint linear complexity and joint minimal polynomial of multisequences have been investigated. Let S be a linear recurring sequence over finite field Fqm with minimal polynomial h(x) over Fqm. Since Fqm and F m q are isomorphic vector spaces over the finite field Fq, S is identified with an m-fold multisequence S over the...
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.07.014